An analogue of the Szemeredi Regularity Lemma for bounded degree graphs
نویسندگان
چکیده
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces in a canonical way. The result can be viewed as a “finitarization” of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
منابع مشابه
An algorithmic version of the blow-up lemma
Recently we developed a new method in graph theory based on the regularity lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, besides the regularity lemma, is the so-called blow-up Ž w Ž .x lemma Komlos, Sarkozy, and Szemeredi Combinatorica, 17, 109]123 1997 . This lemma ́ ́ ̈ ́ helps to find bounded degree spanning subgraph...
متن کاملAn Improved lower bound for arithmetic regularity
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemeredi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ≤ G of bounded index such that, when restricted to most cosets of H, the function f is pseudorandom in the sense that all its nontrivial Fourier coefficients are ...
متن کاملA Regularity Lemma for Bounded Degree Graphs and Its Applications: Parameter Testing and Infinite Volume Limits
We prove a regularity lemma for bounded degree graphs of subexponential growth. As an application we show that the edit-distance from a hereditary property is testable via random samplings in the graph category above. Using the regularity lemma we also prove the existence of the infinite volume limit of some log-partition functions as well as the nonrandomness of the integrated density of state...
متن کامل3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chvátal, Rödl, Szemerédi and Trotter [1] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform ‘pseudo-random’ hypergraphs. keywords: hypergraphs; regularity lemm...
متن کاملThe Regularity Lemma and applications to packings in graphs
In this thesis we investigate applications of Szemerédi’s Regularity Lemma [20]. This result was originally formulated to solve number-theoretical problems. However, we consider its applications in graph theory, in particular to packing results. We begin by introducing some of the basic notions that are needed to understand and use the Regularity Lemma. From this we give an outline of some tool...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009